Strict deterministic grammars

Strict Deterministic Aspects of Minimalist Grammars

The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an association between a vocabulary element and complex of features, and so the “yields” or “fringes” of the derivation trees are sequences of these lexical items, and the string parts of these lexical items are reordered in the...

Deterministic graph grammars

Context-free grammars are one of the most classical and fundamental notions in computer science textbooks, in both theoretical and applied settings. As characterizations of the well-known class of context-free languages, they are a very prominent tool in the field of language theory. Since contextfree grammars are powerful enough to express most programming languages, they also play an importan...

Strict Compositionality and Literal Movement Grammars

The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for example, no notion of a part of a string or structure involved in the formal definition. We shall therefore propose here a stricter version of compositionality. It consists in a conjunction of principles which assure among other ...

Characterizations of stack uniform strict deterministic languages

Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers

Introduction  Gold (1967)  defined the notion of identification in the limit.  showed that even the class of regular languages is not identifiable in the limit from positive data.  defined the notion of polynomial time identification in the limit [3].  has proposed another definition for polynomial time identifiability in the limit from positive data by making a slight modification of Pitt...